Improved Approximation Algorithms for Graph-TSP in k-Regular Bipartite Graphs
نویسندگان
چکیده
We prove new results for approximating Graph-TSP. Speci cally, we provide a polynomial-time 9 7 approximation algorithm for cubic bipartite graphs and a ( 9 7 + 1 21(k−2) )-approximation algorithm for k-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves nding a cycle cover with relatively few cycles, which we are able to do by leveraging the fact that all cycles in bipartite graphs are of even length along with our knowledge of the structure of cubic graphs.
منابع مشابه
RIMS-1826 Approximation Algorithms for the Minimum 2-edge Connected Spanning Subgraph Problem and the Graph-TSP in Regular Bipartite Graphs via Restricted 2-factors By
In this paper, we address the minimum 2-edge connected spanning subgraph problem and the graph-TSP in regular bipartite graphs. For these problems, we present new approximation algorithms, each of which finds a restricted 2-factor close to a Hamilton cycle in the first step. We first prove that every regular bipartite graph of degree at least three has a square-free 2-factor. This immediately l...
متن کاملA -approximation algorithm for Graphic TSP in cubic bipartite graphs
We prove new results for approximating Graphic TSP. Specifically, we provide a polynomialtime 9 7 -approximation algorithm for cubic bipartite graphs and a ( 9 7 + 1 21(k−2) )-approximation algorithm for k-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves finding a cycle cover with relatively few cycles, which we are a...
متن کاملA 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs
We prove new results for approximating Graphic TSP. Specifically, we provide a polynomial-time 9 7 -approximation algorithm for cubic bipartite graphs and a ( 9 7 + 1 21(k−2) )-approximation algorithm for k-regular bipartite graphs, both of which are improved approximation factors compared to previous results. Our approach involves finding a cycle cover with relatively few cycles, which we are ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013